DStrips: Dynamic Triangle Strips for Real-Time Mesh Simplification and Rendering
نویسندگان
چکیده
DStrips is a simple and efficient method to dynamically manage and generate triangle strips for real-time viewdependent multiresolution meshing and rendering. Progressive view-dependent triangle mesh simplification and rendering is an important concept for interactive visualization environments. To minimize the rendering cost, triangle meshes are simplified to the maximal tolerated perceptual error. A further savings can be gained by using hardware optimized rendering primitives such as triangle strips. However, triangle strips have been rarely used successfully in interactive multiresolution meshes due to the costs involved with maintaining the coherency of the strips in the changing mesh. This paper introduces a new dynamic triangle stripping data structure and algorithm, DStrips, that is practical for use with multiresolution meshes. DStrips is aimed at preserving pre-computed triangle strips through changes in the mesh and generating reasonably good triangle strips in real-time. Furthermore, this data structure and algorithm can be easily adapted to any multiresolution mesh which has a face-to-edge/edge-to-face mapping. The presented approach is implemented on top of a real-time view-dependent meshing and rendering framework based on a half-edge data structure using progressive edge collapses and vertex splits. Direct comparisons are made to previous methods in triangle stripification of dynamic and
منابع مشابه
DStrips: Dynamic Triangle Strips for Real-Time Mesh Simplification and Rendering Category: Scientific Research
Multiresolution modelling techniques are important to cope with the increasingly complex polygonal models available today such as high-resolution isosurfaces, large terrains, and complex digitized shapes 21. Large triangle meshes are difficult to render at interactive frame rates due to the large number of vertices to be processed by the graphics hardware. Level-of-detail (LOD) based visualizat...
متن کاملEfficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generation of triangle strips as well as their variants. We present efficient algorithms for partitioning polygonal meshes into triangle strips. Triangle strips have traditionally used a buffer size of two vertices. In this pap...
متن کاملFastMesh: Efficient View-dependent Meshing
In this paper we present an optimized view-dependent meshing framework for adaptive and continuous level-of-detail (LOD) rendering in real-time. Multiresolution triangle mesh representations are an important tool for adapting triangle mesh complexity in real-time rendering environments. Ideally for interactive visualization, a triangle mesh is simplified to the maximal tolerated perceptual erro...
متن کاملEfficiently using connectivity information between triangles in a mesh for real-time renderin
Triangle meshes are the most popular standard model used to represent polygonal surfaces. Drawing these meshes as a set of independent triangles involves sending a vast amount of information to the graphics system. Taking advantage of the connectivity information between the triangles in a mesh dramatically diminishes the amount of information the graphics system must handle. Multiresolution Tr...
متن کاملMemory Efficient Adjacent Triangle Connectivity of a Face Using Triangle Strips
We often need to refer to adjacent elements (e.g., vertices, edges and faces) in triangle meshes for rendering, mesh simplification and other processes. It is, however, sometimes impossible to prepare the enormous memory needed to represent element connectivity in gigantic triangle meshes. We proposed a memory efficient scheme for referring to adjacent faces around a vertex in non-manifold tria...
متن کامل